Homomorphic Signatures for Polynomial Functions
نویسندگان
چکیده
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an efficient algorithm to produce a signature on the mean, standard deviation, and other statistics of the signed data. Previous systems for computing on signed data could only handle linear operations. For polynomials of constant degree, the length of a derived signature only depends logarithmically on the size of the data set. Our system uses ideal lattices in a way that is a “signature analogue” of Gentry’s fully homomorphic encryption. Security is based on hard problems on ideal lattices similar to those in Gentry’s system.
منابع مشابه
Homomorphic Signatures for Polynomial Functions with Shorter Signatures
We present homomorphic signatures for polynomial functions with shorter signatures than the ones of Boneh and Freeman. In the signing algorithm, instead of using the preimage sampling algorithm of Gentry, Peikert, and Vaikuntanathan, we use the algorithm of Micciancio and Peikert, which is more efficient (the algorithm can sample smaller preimages) than the one of Gentry et al. Consequently, th...
متن کاملHomomorphic Signature Schemes - A Survey
Homomorphic signature schemes are an important primitive for many applications and since their introduction numerous solutions have been presented. Thus, in this work we provide the first exhaustive, complete, and up-to-dated survey about the state of the art of homomorphic signature schemes. First, the general framework where homomorphic signatures are defined is described and it is shown how ...
متن کاملOnline-Offline Homomorphic Signatures for Polynomial Functions
The advent of cloud computing has given rise to a plethora of work on verifiable delegation of computation. Homomorphic signatures are a powerful tool that can be tailored for verifiable computation, as long as they are efficiently verifiable. The main advantages of homomorphic signatures are twofold: (i) public verifiability: Any third party can verify the correctness of the delegated computat...
متن کاملBounded Fully Homomorphic Signature Schemes
Homomorphic signatures enable anyone to publicly perform computations on signed data and produce a compact tag to authenticate the results. In this paper, we construct two bounded fully homomorphic signature schemes, as follows. – For any two polynomials d = d(λ), s = s(λ), where λ is the security parameter. Our first scheme is able to evaluate any circuit on the signatures, as long as the dept...
متن کامل(Leveled) Fully Homomorphic Signatures from Lattices
In a homomorphic signature scheme, given a vector of signatures ~σ corresponding to a dataset of messages ~ μ, there is a public algorithm that allows to derive a signature σ′ for message μ′ = f(~ μ) for any function f . Given the tuple (σ′, μ′, f) anyone can publicly verify the result of the computation of function f . Along with the standard notion of unforgeability for signatures, the securi...
متن کامل